Pheromone Evaluation in Ant Colony Optimization
نویسندگان
چکیده
In Ant Colony Optimization (ACO) artiicial ants communicate by laying synthetic pheromone along the edges on their path through a decision graph. This attracts following ants so that they will likely search in the same region of the search space. The problem of how the pheromone information should be evaluated in ant systems is studied in this paper. The standard approach for pheromone evaluation is that ants use for every decision only the local pheromone values corresponding to the possible outcomes of this decision. We show that the optimization behaviour of an ant algorithm can be improved substantially when the ants use more pheromone information than just the local pheromone values. This clearly indicates that the problem of pheromone evaluation is an important topic for Ant Colony Optimization that deserves attention.
منابع مشابه
New Ant Colony Algorithm Method based on Mutation for FPGA Placement Problem
Many real world problems can be modelled as an optimization problem. Evolutionary algorithms are used to solve these problems. Ant colony algorithm is a class of evolutionary algorithms that have been inspired of some specific ants looking for food in the nature. These ants leave trail pheromone on the ground to mark good ways that can be followed by other members of the group. Ant colony optim...
متن کاملAnt Colony Optimization Algorithm Based on Dynamical Pheromones for Clustering Analysis
This paper presents an improved clustering algorithm with Ant Colony optimization (ACO) based on dynamical pheromones. Pheromone is an important factor for the performance of ACO algorithms. Two strategies based on adaptive pheromones which improved performance are introduced in this paper. One is to adjust the rate of pheromone evaporation dynamically, named as , and the other is to adjust t...
متن کاملAn Improved Model of Ant Colony Optimization Using a Novel Pheromone Update Strategy
The paper introduces a novel pheromone update strategy to improve the functionality of ant colony optimization algorithms. This modification tries to extend the search area by an optimistic reinforcement strategy in which not only the most desirable sub-solution is reinforced in each step, but some of the other partial solutions with acceptable levels of optimality are also favored. therefore, ...
متن کاملMulti-objective Reconfiguration of Distribution Network Using a Heuristic Modified Ant Colony Optimization Algorithm
In this paper, a multi-objective reconfiguration problem has been solved simultaneously by a modified ant colony optimization algorithm. Two objective functions, real power loss and energy not supplied index (ENS), were utilized. Multi-objective modified ant colony optimization algorithm has been generated by adding non-dominated sorting technique and changing the pheromone updating rule of ori...
متن کاملSolving the Vehicle Routing Problem with Simultaneous Pickup and Delivery by an Effective Ant Colony Optimization
One of the most important extensions of the capacitated vehicle routing problem (CVRP) is the vehicle routing problem with simultaneous pickup and delivery (VRPSPD) where customers require simultaneous delivery and pick-up service. In this paper, we propose an effective ant colony optimization (EACO) which includes insert, swap and 2-Opt moves for solving VRPSPD that is different with common an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000